Intersection graph

Results: 65



#Item
51GEOMETRIC INTERSECTION PROBLEMS  t Michael Ian Shamos Departments of Computer Science and Mathematics

GEOMETRIC INTERSECTION PROBLEMS t Michael Ian Shamos Departments of Computer Science and Mathematics

Add to Reading List

Source URL: euro.ecom.cmu.edu

Language: English - Date: 2012-10-31 17:55:32
52R(4,5) = 25  Brendan D. McKay+ Stanislaw P. Radziszowski∗

R(4,5) = 25 Brendan D. McKay+ Stanislaw P. Radziszowski∗

Add to Reading List

Source URL: cs.anu.edu.au

Language: English - Date: 2007-05-03 03:40:54
53CIRCLE PACKING BIBLIOGRAPHY AS OF SEPTEMBER 2005 MAINTAINED BY KENNETH STEPHENSON The term circle packing here refers to configurations of circles with specified patterns of tangency, intersection, or separation. The cen

CIRCLE PACKING BIBLIOGRAPHY AS OF SEPTEMBER 2005 MAINTAINED BY KENNETH STEPHENSON The term circle packing here refers to configurations of circles with specified patterns of tangency, intersection, or separation. The cen

Add to Reading List

Source URL: www.math.utk.edu

Language: English - Date: 2013-01-04 17:01:21
54NIST, ACMD Seminar Series, February[removed]On the intersection of random graphs with an application to random key pre-distributionab  Armand M. Makowski

NIST, ACMD Seminar Series, February[removed]On the intersection of random graphs with an application to random key pre-distributionab Armand M. Makowski

Add to Reading List

Source URL: math.nist.gov

Language: English - Date: 2014-02-26 12:24:41
55NPS-MA[removed]NAVAL POSTGRADUATE SCHOOL Monterey, California  A Partial Ordering of the Chordal Graphs

NPS-MA[removed]NAVAL POSTGRADUATE SCHOOL Monterey, California A Partial Ordering of the Chordal Graphs

Add to Reading List

Source URL: edocs.nps.edu

Language: English - Date: 2004-06-04 13:12:50
56Discrete Comput Geom 30:65–[removed]DOI: [removed]s00454[removed]Discrete & Computational  Geometry

Discrete Comput Geom 30:65–[removed]DOI: [removed]s00454[removed]Discrete & Computational Geometry

Add to Reading List

Source URL: www.math.purdue.edu

Language: English - Date: 2010-06-16 13:35:46
57Random Intersection Graphs Michal Karo´ nski∗ In most models of random graphs, the edges enjoy all the attention and the vertices are passive bystanders. In Erd˝os-R´enyi random graph, we are

Random Intersection Graphs Michal Karo´ nski∗ In most models of random graphs, the edges enjoy all the attention and the vertices are passive bystanders. In Erd˝os-R´enyi random graph, we are

Add to Reading List

Source URL: www.ims.nus.edu.sg

Language: English - Date: 2010-01-12 23:03:00
58University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics

University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics

Add to Reading List

Source URL: zvonka.fmf.uni-lj.si

Language: English - Date: 2009-06-22 08:59:07
59Register Allocation after Classical SSA Elimination is NP-complete Fernando Magno Quint˜ao Pereira

Register Allocation after Classical SSA Elimination is NP-complete Fernando Magno Quint˜ao Pereira

Add to Reading List

Source URL: www.cs.ucla.edu

Language: English - Date: 2006-02-05 20:11:50
60

PDF Document

Add to Reading List

Source URL: www-pr.informatik.uni-tuebingen.de

Language: English - Date: 2007-10-30 11:31:52